HiLog: A foundation for higher-order logic programming

HILOG: A Foundation for Higher-Order Logic Programming

D We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitrary terms to appear in places where predicates, functions, and atomic formulas occur in predicate calculus. But its semantics is first-order and admits a sound and complete proof procedure. Applic...

HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs

A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming

Higher-order logic programming languages such as Elf extend first-order logic programming in two ways: first-order terms are replaced with (dependently) typed λ-terms and the body of clauses may contain implication and universal quantification. In this paper, we describe tabled higher-order logic programming where some redundant computation is eliminated by memoizing sub-computation and re-usin...

Sorted HiLog: Sorts in Higher-Order Logic Data Languages

HiLog enhances the modeling capabilities of deductive databases and logic programming with higher-order and meta-data constructs, complex objects, and schema browsing. Its distinctive feature, a higher-order syntax with a rst-order semantics, allows for eecient implementation with speeds comparable to Prolog. In fact, HiLog implementation in XSB 30, 26] together with tabulated query evaluation ...

Higher-Order Logic Programming